The firefighter problem for regular infinite directed grids
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Stochastic Firefighter Problem
The dynamics of infectious diseases spread is crucial in determining their risk and offering ways to contain them. We study sequential vaccination of individuals in networks. In the original (deterministic) version of the Firefighter problem, a fire breaks out at some node of a given graph. At each time step, b nodes can be protected by a firefighter and then the fire spreads to all unprotected...
متن کاملThe firefighter problem with more than one firefighter on trees
In this paper we study the complexity of the firefighter problem and related problems on trees when more than one firefighter is available at each time step, and answer several open questions of [8]. More precisely, when b ≥ 2 firefighters are allowed at each time step, the problem is NP-complete for trees of maximum degree b+2 and polynomial-time solvable for trees of maximum degree b + 2 when...
متن کاملThe firefighter problem for cubic graphs
We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is the same distance from the root, it is NPcomplete to decide whether or not there is a strategy that protects every leaf from the fire, which starts at the root. By contrast, we describe a polynomial time algorithm to decide if it is possible ...
متن کاملThe L(2, 1)-Labeling Problem on Oriented Regular Grids
The L(2, 1)-labeling of a digraph G is a function f from the node set of G to the set of all nonnegative integers such that |f(x) − f(y)| ≥ 2 if x and y are at distance 1, and f(x) 6= f(y) if x and y are at distance 2, where the distance from vertex x to vertex y is the length of a shortest dipath from x to y. The minimum of the maximum used label over all L(2, 1)-labelings of G is called λ(G)....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Involve, a Journal of Mathematics
سال: 2012
ISSN: 1944-4184,1944-4176
DOI: 10.2140/involve.2012.5.393